Efficient computation of the Zassenhaus formula
نویسندگان
چکیده
منابع مشابه
Efficient computation of the Zassenhaus formula
A new recursive procedure to compute the Zassenhaus formula up to high order is presented, providing each exponent in the factorization directly as a linear combination of independent commutators and thus containing theminimumnumber of terms. The recursion can be easily implemented in a symbolic algebra package and requires much less computational effort, both in time and memory resources, than...
متن کاملA q-Analogue of the Zassenhaus Formula for Disentan- gling Exponential Operators
The general structure of a q-analogue of the Zassenhaus formula, the dual of the Baker-Campbell-Hausdorff formula for combining exponential operators, is derived and the first few terms of the disentanglement of a q-exponential operator are explicitly given.
متن کاملThe Schur–zassenhaus Theorem
When N is a normal subgroup of G, can we reconstruct G from N and G/N? In general, no. For instance, the groups Z/(p2) and Z/(p) × Z/(p) (for prime p) are nonisomorphic, but each has a cyclic subgroup of order p and the quotient by it also has order p. As another example, the nonisomorphic groups Z/(2p) and Dp (for odd prime p) have a normal subgroup that is cyclic of order p, whose quotient is...
متن کاملnano-rods zno as an efficient catalyst for the synthesis of chromene phosphonates, direct amidation and formylation of amines
چکیده ندارد.
Improvements on the Cantor-Zassenhaus Factorization Algorithm
We describe a new simplified version of the Cantor-Zassenhaus polynomial factorization algorithm, which entails a lower computational cost. The key point is to use linear test polynomials, which not only reduce the computational burden, but also enable us to derive good estimates and deterministic bounds on the number of attempts needed to factor a given polynomial. Mathematics Subject Classifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2012
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2012.06.006